On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming

During the last decade interior-point methods have become an eecient alternative to the simplex algorithm for solution of large-scale linear programming (LP) problems. However, in many practical applications of LP, interior-point methods have the drawback that they do not generate an optimal basic and nonbasic partition of the variables. This partition is required in the traditional sensitivity analysis and is highly useful when a sequence of related LP problems are solved. Therefore, in this paper we discuss how an optimal basic solution can be generated from the interior-point solution. The emphasis of the paper is on how problem structure can be exploited to reduce the computational cost associated with the basis iden-tiication. Computational results are presented which indicate that it is highly advantageous to exploit problem structure.